Computational complexity of norm-maximization
نویسندگان
چکیده
منابع مشابه
Computational Complexity of Tensor Nuclear Norm
The main result of this paper is that the weak membership problem in the unit ball of a given norm is NP-hard if and only if the weak membership problem in the unit ball of the dual norm is NP-hard. Equivalently, the approximation of a given norm is polynomial time if and only if the approximation of the dual norm is polynomial time. Using the NP-hardness of the approximation of spectral norm o...
متن کاملFixed Parameter Complexity and Approximability of Norm Maximization
The problem of maximizing the p-th power of a p-norm over a halfspace-presented polytope in Rd is a convex maximization problem which plays a fundamental role in computational convexity. It has been shown in [19] that this problem is NP-hard for all values p ∈ N, if the dimension d of the ambient space is part of the input. In this paper, we use the theory of parametrized complexity to analyze ...
متن کاملOn the Computational Complexity of the Domination Game
The domination game is played on an arbitrary graph $G$ by two players, Dominator and Staller. It is known that verifying whether the game domination number of a graph is bounded by a given integer $k$ is PSPACE-complete. On the other hand, it is showed in this paper that the problem can be solved for a graph $G$ in $mathcal O(Delta(G)cdot |V(G)|^k)$ time. In the special case when $k=3$ and the...
متن کاملthe effect of task complexity on lexical complexity and grammatical accuracy of efl learners’ argumentative writing
بر اساس فرضیه شناخت رابینسون (2001 و 2003 و 2005) و مدل ظرفیت توجه محدود اسکهان (1998)، این تحقیق تاثیر پیچیدگی تکلیف را بر پیچیدگی واژگان و صحت گرامری نوشتار مباحثه ای 60 نفر از دانشجویان زبان انگلیسی بررسی کرد. میزان پیچیدگی تکلیف از طریق فاکتورهای پراکندگی-منابع تعیین شد. همه ی شرکت کنندگان به صورت نیمه تصادفی به یکی از سه گروه: (1) گروه موضوع، (2) گروه موضوع + اندیشه و (3) گروه موضوع + اندی...
15 صفحه اولSampling and Representation Complexity of Revenue Maximization
We consider (approximate) revenue maximization in auctions where the distribution on input valuations is given via “black box” access to samples from the distribution. We observe that the number of samples required – the sample complexity – is tightly related to the representation complexity of an approximately revenue-maximizing auction. Our main results are upper bounds and an exponential low...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Combinatorica
سال: 1990
ISSN: 0209-9683,1439-6912
DOI: 10.1007/bf02123011